Compiling constraints in clp(FD)

COMPILING CONSTRAINTS IN lp ( FD )

Compiling Ask Constraints

In this paper we investigate how to extend a generic constraint solver that provides not only tell constraints (by adding the constraint to the store) but also ask tests (by checking whether the constraint is entailed by the store), with general ask constraints. Ask constraints are important for implementing constraint implication, extensible solvers using dynamic scheduling and reification. Wh...

Compiling State Constraints

The evaluation of constraints needs in many cases that a large portion of the database to be accessed. This makes the process of integrity checking very di cult to implement e ciently. Thus nding methods to improve the evaluation of integrity constraints is an important area of research in the eld of database integrity. Most of these methods are based on simpli cation principles. One of these m...

Compiling Constraints in clp(FD)

We present the clp(FD) system: a Constraint Logic Programming language with finite domain constraints. We detail its implementation and present an abstract instruction set for the constraint solver that can be smoothly integrated into the WAM architecture. It is based on the use of a single primitive constraintX in r that embeds the core propagation mechanism. Complex user constraints such as l...

Compiling Semiring-based Constraints